Clarifying Elkan's theoretical result
نویسندگان
چکیده
This paper is devoted to clarify the only theoretical result included in the controversial work of C. Elkan “The paradoxical success of fuzzy logic” (1994), by offering both a short proof of it and a larger one that tries to show the structural reasons of such result.
منابع مشابه
On the power of fuzzy logic
In this paper we address lhe issues brought by Elkan in his article, "The Paradoxical Success of Fuzzy Logic" [3]. Elkan's work has caused concem since purportedly reveals a Fuzzy Logic weakness regarding its theoretical foundations. A further investigation of Elkan's theorem ("theorem 1") revealed that its conclusion is not correct. Afier indicating lhe points where we disagree with Elkan, we ...
متن کاملOn Elkan's theorems: Clarifying their meaning via simple proofs
This article deals with the claims that “a standard version of fuzzy logic collapses mathematically to two-valued logic” made by Charles Elkan in two papers @Proc 11th National Conf on AI, Menlo Park, CA: AAAI Press, 1993, pp 698–703; IEEE Expert 1994;9:3–8#. Although Elkan’s effort to trivialize fuzzy logic has been questioned by numerous authors, our aim is to examine in detail his formal arg...
متن کاملCalibrating random forests for probability estimation
Probabilities can be consistently estimated using random forests. It is, however, unclear how random forests should be updated to make predictions for other centers or at different time points. In this work, we present two approaches for updating random forests for probability estimation. The first method has been proposed by Elkan and may be used for updating any machine learning approach yiel...
متن کاملElkan ' s theoretical argument , reconsidered q
This paper takes part in the discussion motivated by Elkan's paper ``The Paradoxical Success of Fuzzy Logic'' printed in 1993, whose main theoretical point was that Fuzzy Logic does not properly deal with a speci®c Law of Classical Logic: : p ^ :q q _ :p ^ :q. The given answer can be summarized, like in other previous cases, by the sentence ``Yes it can but, of course, at some cost''. As i...
متن کاملElkan's k-Means for Graphs
This paper extends k-means algorithms from the Euclidean domain to the domain of graphs. To recompute the centroids, we apply subgradient methods for solving the optimization-based formulation of the sample mean of graphs. To accelerate the k-means algorithm for graphs without trading computational time against solution quality, we avoid unnecessary graph distance calculations by exploiting the...
متن کامل